std::deque::push_back

From Cppreference

< cpp | container | deque

Jump to: navigation, search

Language
Utilities library
Strings library
Containers library
Algorithms library
Iterators library
Numerics library
Input/output library
Localizations library
Regular expressions library (C++11)
Atomic operations library (C++11)
Thread support library (C++11)

(C++11)

(C++11)

(C++11)

unordered_multiset

(C++11)

(C++11)

unordered_multimap

(C++11)

Member functions

deque::operator=

deque::get_allocator

Element access

Iterators

deque::begin
deque::cbegin

(C++11)

deque::end
deque::cend

(C++11)

deque::rbegin
deque::crbegin

(C++11)

deque::rend
deque::crend

(C++11)

Capacity

deque::max_size

deque::shrink_to_fit

Modifiers

deque::push_front

deque::emplace_front

deque::pop_front

deque::push_back

deque::emplace_back

deque::pop_back


void push_back( const T& value );

void push_back( T&& value );		(since C++11)

Appends the given element value to the end of the container.

Contents

1 Parameters
2 Return value
3 Complexity
4 Example
5 See also

[edit] Parameters

value

-

the value of the element to append

[edit] Return value

(none)

[edit] Complexity

Constant.

[edit] Example

The following code uses push_back to add several integers to a std::deque<int>:

#include <deque>
#include <iostream>
 
int main()
{
    std::deque<int> numbers;
 
    numbers.push_back(42);
    numbers.push_back(314159); 
 
    for (int i : numbers) { // c++11 range-based for loop
        std::cout << i << '\n';
    } 
 
    return 0;
}

Output:

42
314159

[edit] See also


emplace_back (C++11)	constructs elements in-place at the end (public member function)

push_front	inserts elements to the beginning (public member function)

pop_back	removes the last element (public member function)

Retrieved from "http://en.cppreference.com/w/cpp/container/deque/push_back"

Personal tools

Log in / create account

Toolbox

In other languages